Small Models of Large Machines
نویسندگان
چکیده
In this paper, we model large support vector machines (SVMs) by smaller networks in order to decrease the computational cost. The key idea is to generate additional training patterns using a trained SVM and use these additional patterns along with the original training patterns to train a neural network. Results verify the validity of the technique. Introduction A key element in a pattern recognition system is the classifier. In nearest neighbor classifiers (NNCs) the input feature vector is compared to all the training patterns and assigned to the class to which the nearest training pattern belongs. The NNC approximates the Bayes classifier (Fukunaga 1990), but is computationally very expensive. A multilayer perceptron (MLP) classifier approximates Bayes discriminant in a least squares sense (Ruck et al. 1990) and is computationally more economic than an NNC. However, it requires many training patterns in order to generalize and it is sensitive to initial values of the weights. Support vector machines (SVMs) (Vapnik 1998) map the inputs to a large feature space, making use of classical regularization, and allowing a subset of the training patterns to be support vectors. SVMs can often develop good decision boundaries from small data sets. However, it is difficult to find the best kernel and kernel parameters (Brown et al. 2000), and the resulting structure is too large and redundant. Attempts have been made to reduce the size of the SVM (de Kruif & de Vries 2003) by deleting some patterns and by developing the Reduced Support Vector Machine (RSVM) (Lee & Huang 2007), pruning of the SVM (de Kruif & de Vries 2003) and the Relevance Vector Machine (RVM) (Tipping 2000). Unfortunately, networks resulting from these techniques are still large. In this paper, we model SVMs by much smaller machines, in order to reduce computational complexity. First, we review the MLP and the SVM. Pattern memorization in SVMs is investigated next. We then present methods for compact modeling of the SVM. Finally, we provide numerical results and conclusions. Copyright c © 2008, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. Review Of Learning Machines In this section we review MLP and SVM classifiers. Multilayer Perceptron Let {xp, tp} Nv p=1 be the training dataset where xp ∈ R N is the input vector, tp ∈ R M is the desired output vector and Nv is the number of patterns. Figure 1 depicts a feedforward MLP, having one hidden layer with Nh nonlinear units and an output layer with M linear units. For the p pattern, the j hidden unit’s net function, {netpj} Nh j=1, and activation, {Opj} Nh j=1, are
منابع مشابه
Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملPrediction of Seismic Wave Intensity Generated by Bench Blasting Using Intelligence Committee Machines
In large open pit mines prediction of Peak Particle Velocity (PPV) provides useful information for safe blasting. At Sungun Copper Mine (SCM), some unstable rock slopes facing to valuable industrial facilities are both expose to high intensity daily blasting vibrations, threatening their safty. So, controlling PPV by developing accurate predictors is essential. Hence, this study proposes improv...
متن کاملApplication of Artificial Neural Networks and Support Vector Machines for carbonate pores size estimation from 3D seismic data
This paper proposes a method for the prediction of pore size values in hydrocarbon reservoirs using 3D seismic data. To this end, an actual carbonate oil field in the south-western part ofIranwas selected. Taking real geological conditions into account, different models of reservoir were constructed for a range of viable pore size values. Seismic surveying was performed next on these models. F...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملPerformance evaluation of chain saw machines for dimensional stones using feasibility of neural network models
Prediction of the production rate of the cutting dimensional stone process is crucial, especially when chain saw machines are used. The cutting dimensional rock process is generally a complex issue with numerous effective factors including variable and unreliable conditions of the rocks and cutting machines. The Group Method of Data Handling (GMDH) type of neural network and Radial Basis Functi...
متن کاملPerformance evaluation of the croissant production line with reparable machines
In this study, the analytical probability models for an automated serial production system, bufferless that consists of n-machines in series with common transfer mechanism and control system was developed. Both time to failure and time to repair a failure are assumed to follow exponential distribution. Applying those models, the effect of system parameters on system performance in actu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008